Suszko’s Thesis and dyadic semantics

A well-known result by Wójcicki-Lindenbaum shows that any tarskian logic is many-valued, and another result by Suszko shows how to provide 2-valued semantics to these very same logics. This paper investigates the question of obtaining 2-valued semantics for many-valued logics, including paraconsistent logics, in the lines of the so-called “Suszko’s Thesis”. We set up the bases for developing a general algorithmic method to transform any truth-functional finite-valued semantics satisfying reasonable conditions into a computable quasi tabular 2-valued semantics, that we call dyadic. We also discuss how “Suszko’s Thesis” relates to such a method, in the light of truth-functionality, while at the same time we reject an endorsement of Suszko’s philosophical views about the misconception of